Directly Visible Pairs and Illumination by Reflections in Orthogonal Polygons
نویسندگان
چکیده
We consider direct visibility in simple orthogonal polygons and derive tight lower and upper bounds on the number of strictly internal and external visibility edges. We also show a lower bound of ⌈n2 ⌉ − 1 on the number of diffuse reflections required for completely illuminating an orthogonal polygon from an arbitrary point inside it. Further, we derive lower bounds on the combinatorial complexity of the visibility polygon of a point source S after k ≥ 1 specular reflections within special classes of polygons.
منابع مشابه
A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملGuarding Path Polygons with Orthogonal Visibility
We are interested in the problem of guarding simple orthogonal polygons with the minimum number of r-guards. The interior point p belongs an orthogonal polygon P is visible from r-guard g, if the minimum area rectangle contained p and q lies within P . A set of point guards in polygon P is named guard set (as denoted G) if the union of visibility areas of these point guards be equal to polygon ...
متن کاملMinimum Hidden Guarding of Histogram Polygons
A hidden guard set G is a set of point guards in polygon P that all points of the polygon are visible from some guards in G under the constraint that no two guards may see each other. In this paper, we consider the problem for finding minimum hidden guard sets in histogram polygons under orthogonal visibility. Two points p and q are orthogonally visible if the orthogonal bounding rectangle for ...
متن کاملModem illumination of monotone polygons
We study a generalization of the classical problem of illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number k of walls. We call these objects k-modems and study the minimum number of k-modems necessary to illuminate monotone and monotone orthogonal polygons. We show that every monotone polygon on n vertices can be...
متن کاملCovering Grids and Orthogonal Polygons with Periscope Guards
Gewali, L.P. and S. Ntafos, Covering grids and orthogonal polygons with periscope guards, Computational Geometry: Theory and Applications 2 (1993) 309-334. The problem of finding minimum guard covers is NP-hard for simple polygons and open for simple orthogonal polygons. Alternative definitions of visibility have been considered for orthogonal polygons. In this paper we try to determine the com...
متن کامل